首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   132220篇
  免费   17891篇
  国内免费   12868篇
工业技术   162979篇
  2024年   442篇
  2023年   2618篇
  2022年   4958篇
  2021年   5720篇
  2020年   5720篇
  2019年   4016篇
  2018年   3411篇
  2017年   3956篇
  2016年   4198篇
  2015年   4895篇
  2014年   8854篇
  2013年   7852篇
  2012年   10071篇
  2011年   10880篇
  2010年   8244篇
  2009年   8546篇
  2008年   8947篇
  2007年   9994篇
  2006年   8603篇
  2005年   7748篇
  2004年   6398篇
  2003年   5748篇
  2002年   4499篇
  2001年   3653篇
  2000年   3018篇
  1999年   2429篇
  1998年   1784篇
  1997年   1413篇
  1996年   1164篇
  1995年   873篇
  1994年   641篇
  1993年   454篇
  1992年   302篇
  1991年   187篇
  1990年   150篇
  1989年   127篇
  1988年   90篇
  1987年   40篇
  1986年   62篇
  1985年   57篇
  1984年   49篇
  1983年   40篇
  1982年   43篇
  1981年   19篇
  1980年   9篇
  1979年   13篇
  1978年   4篇
  1963年   4篇
  1959年   5篇
  1951年   6篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
摘 要:核心网业务模型的建立是5G网络容量规划和网络建设的基础,通过现有方法得到的理论业务模型是静态不可变的且与实际网络存在偏离。为了克服现有5G核心网业务模型与现网模型适配性较差以及规划设备无法满足用户实际业务需求的问题,提出了一种长短期记忆(long short-term memory,LSTM)网络与卷积LSTM (convolution LSTM,ConvLSTM)网络双通道融合的 5G 核心网业务模型预测方法。该方法基于人工智能(artificial intelligence,AI)技术以实现高质量的核心网业务模型的智能预测,形成数据反馈闭环,实现网络自优化调整,助力网络智能化建设。  相似文献   
42.
43.
In this paper, we strive to propose a self-interpretable framework, termed PrimitiveTree, that incorporates deep visual primitives condensed from deep features with a conventional decision tree, bridging the gap between deep features extracted from deep neural networks (DNNs) and trees’ transparent decision-making processes. Specifically, we utilize a codebook, which embeds the continuous deep features into a finite discrete space (deep visual primitives) to distill the most common semantic information. The decision tree adopts the spatial location information and the mapped primitives to present the decision-making process of the deep features in a tree hierarchy. Moreover, the trained interpretable PrimitiveTree can inversely explain the constituents of the deep features, highlighting the most critical and semantic-rich image patches attributing to the final predictions of the given DNN. Extensive experiments and visualization results validate the effectiveness and interpretability of our method.  相似文献   
44.
针对光谱反射率研究中因训练样本数据量大造成的冗杂等问题,提出了一种基于RGB信息进行聚类的样本分类方法。首先对颜色进行聚类并确定聚类个数,后对每一类光谱反射率使用BP神经网络分别进行重建。对于实验结果,使用ΔE00、均方根误差(RMSE)以及适应度系数等标准进行评价,同时与主成分分析算法进行对比。从实验分析可得出,在聚类数目为7时光谱反射率重建效果最好,这时的平均CIE2000的色差为0.836,平均RMSE为0.0149,平均适应度系数为99.82%,并且,在最后对重建色差较大的色块进行了优化处理。实验证明,颜色聚类方法可以很好的应用于光谱反射率重建。  相似文献   
45.
Most existing image restoration methods based on deep neural networks are developed for images which only degraded by a single degradation mode and imaging under an ideal condition. They cannot be directly used to restore the images degraded by multi-factor coupling. A complex task decomposition regularization optimization strategy (TDROS) is proposed to solve the problem. The restoration of images degraded by multi-factor coupling is a complex task that can be solved by separating these multiple factors, that is, breaking the complex task into numbers of simpler tasks to make the entire complex problem be overcome more easily. Motivated by this idea, the TDROS decomposes the complex task of image restoration into two sub-task: the potential task constrained by regularization and the main task for reconstructing high-definition images. In TDROS, the front of the neural network is focused on the restoration of images degraded by additive noise, while the other part of the network is focused mainly on the restoration of images degraded by blur. We applied the TDROS to an 11-layer convolutional neural network (CNN) and compared it with initial CNNs from the aspects of restoration accuracy and generalization ability. Based on these results, we used TDROS to design a novel network model for the restoration of atmospheric turbulence-degraded images. The experimental results demonstrate that the proposed TDROS can improve the generalization ability of the existing network more effectively than current popular methods, offering a better solution for the problem of severely degraded image restoration. Moreover, the TDROS concept provides a flexible framework for low-level visual complex tasks and can be easily incorporated into existing CNNs.  相似文献   
46.
Recent generative adversarial networks (GANs) have yielded remarkable performance in face image synthesis. GAN inversion embeds an image into the latent space of a pretrained generator, enabling it to be used for real face manipulation. However, current inversion approaches for real faces suffer the dilemma of initialization collapse and identity loss. In this paper, we propose a hierarchical GAN inversion for real faces with identity preservation based on mutual information maximization. We first use a facial domain guaranteed initialization to avoid the initialization collapse. Furthermore, we prove that maximizing the mutual information between inverted faces and their identities is equivalent to minimizing the distance between identity features from inverted and original faces. Optimization for real face inversion with identity preservation is implemented on this mutual information-maximizing constraint. Extensive experimental results show that our approach outperforms state-of-the-art solutions for inverting and editing real faces, particularly in terms of face identity preservation.  相似文献   
47.
现有的图像修复方法在处理大面积缺失或高度纹理化的图像时,通常会产生扭曲的结构或与周围区域不一致的模糊纹理,无法重建合理的图像结构。为此,提出了一种基于推理注意力机制的二阶段网络图像修复方法。首先通过边缘生成网络生成合理的幻觉边缘信息,然后在图像补全网络完成图像的重建工作。为了进一步生成视觉效果更逼真的图像,提高图像修复的精确度,在图像补全网络采用推理注意力机制,有效控制了生成特征的不一致性,从而生成更有效的信息。所提方法在多个数据集上进行了实验验证,结果表明该图像修复方法的结构相似性指数达到了88.9%,峰值信噪比达到了25.56 dB,与现有的图像修复方法相比,该方法具有更高的图像修复精确度,生成的图像更逼真。  相似文献   
48.
A key element in solving real-life data science problems is selecting the types of models to use. Tree ensemble models (such as XGBoost) are usually recommended for classification and regression problems with tabular data. However, several deep learning models for tabular data have recently been proposed, claiming to outperform XGBoost for some use cases. This paper explores whether these deep models should be a recommended option for tabular data by rigorously comparing the new deep models to XGBoost on various datasets. In addition to systematically comparing their performance, we consider the tuning and computation they require. Our study shows that XGBoost outperforms these deep models across the datasets, including the datasets used in the papers that proposed the deep models. We also demonstrate that XGBoost requires much less tuning. On the positive side, we show that an ensemble of deep models and XGBoost performs better on these datasets than XGBoost alone.  相似文献   
49.
互联网通讯采取标准化模式主要以TCP/IP协议为载体,通讯的优越特性体现在同时具备便捷性与开放性,为办公提供很大的便利,但基于网络系统也会入侵病毒、也会给信息数据与办公体系安全性造成威胁,直接影响企业综合稳定发展。据此,为保障办公工作的顺利开展,本文对计算机网络办公自动化及安全策略进行详细分析。  相似文献   
50.
In actual engineering scenarios, limited fault data leads to insufficient model training and over-fitting, which negatively affects the diagnostic performance of intelligent diagnostic models. To solve the problem, this paper proposes a variational information constrained generative adversarial network (VICGAN) for effective machine fault diagnosis. Firstly, by incorporating the encoder into the discriminator to map the deep features, an improved generative adversarial network with stronger data synthesis capability is established. Secondly, to promote the stable training of the model and guarantee better convergence, a variational information constraint technique is utilized, which constrains the input signals and deep features of the discriminator using the information bottleneck method. In addition, a representation matching module is added to impose restrictions on the generator, avoiding the mode collapse problem and boosting the sample diversity. Two rolling bearing datasets are utilized to verify the effectiveness and stability of the presented network, which demonstrates that the presented network has an admirable ability in processing fault diagnosis with few samples, and performs better than state-of-the-art approaches.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号